Cs 255 Notes
نویسنده
چکیده
1. Overview and The One-Time Pad: 1/7/2013 1 2. Pseudorandom Generators: 1/9/2013 3 Week 1 Videos: History of Cryptography and Discrete Probability 5 3. More Stream Ciphers : 1/14/2013 7 4. Block Ciphers : 1/16/2013 9 5. Section 1: Getting Started With Javascript, taught by Lucas Garron: 1/18/2013 11 6. AES: 1/23/2013 12 7. More PRFs and PRPs: 1/28/2013 13 8. Message Authentication Codes: 1/30/2013 15 9. Section 2: More on the First Project, taught by Lucas Garron: 2/1/2013 17 10. Collision Resistance : 2/4/2013 18 11. Cryptography and Security at Facebook: 2/6/2013 19 12. Authenticated Encryption: 2/11/2013 21 13. Key Management: 2/13/2013 23 14. Section 3: Number Theory: 2/15/2013 25 15. Trapdoor and One-Way Functions: 2/20/2013 27 16. More RSA and Public-Key Signatures: 2/25/2013 29 17. More Digital Signatures: 2/27/2013 31 18. Section 4: The Chinese Remainder Theorem and SSL: 3/1/2013 33 19. One-time Signatures: 3/4/2013 33 20. SSL, TLS, and More About PKIs: 3/6/2013 35 21. User Authentication: ID Protocols: 3/11/2013 37 22. Advanced Topics: Elliptic Curves: 3/13/2013 40
منابع مشابه
Cs 255 (introduction to Cryptography)
Notes taken in Professor Boneh’s Introduction to Cryptography course (CS 255) in Winter, 2012. There may be errors! Be warned!
متن کاملBU CAS CS 332, Spring 2009: Section Notes
This document contains notes corresponding to the material that has been or will be covered during the discussion sections of the spring 2009 iteration of the course BU CAS CS 332, taught by Professor Leonid Levin. These notes will contain intuitive exposition, as well as problems and examples that demonstrate how the definitions and theorems presented during lectures and in the official lectur...
متن کاملLecture 2 Sequence Similarity January 4 & 9 , 1996 Lecturer : Martin Tompa Notes : Elizabeth Walkup
Rotating notetaking: Notes are to be written up in LaTEX if you know it, or plain text if not, and sent by electronic mail to karp@cs, ruzzo@cs, or tompa@cs, as appropriate. (If in LaTEX, see the instructions in /homes/june/ruzzo/SHARED/590bi/lectures/DIRECTIONS. If in plain text, don’t worry much about mathematical formulas, figures, bibliography citations, etc.) Notes are due at noon the day ...
متن کاملCS 170 : Efficient Algorithms and Intractable Problems Fall 2001
These is the complete set of lectures notes for the Fall 2001 offering of CS170. The notes are, mostly, a revised version of notes used in past semesters. I believe there may be several errors and imprecisions.
متن کامل